Course contents: Convex hulls. Segment intersection. Polygon triangulation. Halfplane intersection. Lower envelopes and Duality. Orthogonal range searching. Point location. Voronoi diagrams. Delaunay triangulations. Line arrangements. Linear programming.

Assessment: Assignments with weight 50% and written exam.